The Kakeya problem: a gap in the spectrum and classification of the smallest examples
نویسندگان
چکیده
Kakeya sets in the affine plane AG(2, q) are point sets that are the union of lines, one through every point on the line at infinity. The finite field Kakeya problem asks for the size of the smallest Kakeya sets and the classification of these Kakeya sets. In this article we present a new example of a small Kakeya set and we give the classification of the smallest Kakeya sets up to weight q(q+2) 2 + q 4 , both in case q even.
منابع مشابه
ساختار نواری و تابش گرمایی بلور فوتونیکی دو بعدی سیلیکونی
In this research, we have studied the photonic band structure, optical properties and thermal emission spectrum of 2D Silicon photonic crystal with hexagonal structure. The band structure, band gap map and the gap size versus radius have been calculated by plane wave expansion method. The maximum band gap size of TE (TM) polarization and the complete gap size are 51% (20%) and 17% at air hole r...
متن کاملImprovement of the Classification of Hyperspectral images by Applying a Novel Method for Estimating Reference Reflectance Spectra
Hyperspectral image containing high spectral information has a large number of narrow spectral bands over a continuous spectral range. This allows the identification and recognition of materials and objects based on the comparison of the spectral reflectance of each of them in different wavelengths. Hence, hyperspectral image in the generation of land cover maps can be very efficient. In the hy...
متن کاملQuality Gap in Educational Services at Zahedan University of Medical Sciences: Students Viewpoints about Current and Optimal Condition
Introduction. The first basic step in developing any quality improvement program is determining the quality gap and, adopting strategies for removing or reducing this gap. This study was performed to determine the quality gap in educational services at Zahedan University of Medical Sciences, based on students’ perceptions and expectations. Methods. In this cross-sectional descriptive study, 38...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملSteel Buildings Damage Classification by damage spectrum and Decision Tree Algorithm
Results of damage prediction in buildings can be used as a useful tool for managing and decreasing seismic risk of earthquakes. In this study, damage spectrum and C4.5 decision tree algorithm were utilized for damage prediction in steel buildings during earthquakes. In order to prepare the damage spectrum, steel buildings were modeled as a single-degree-of-freedom (SDOF) system and time-history...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 72 شماره
صفحات -
تاریخ انتشار 2014